Removing Bidirectionality from Nondeterministic Finite Automata
نویسنده
چکیده
We prove that every two-way nondeterministic finite automaton with n states has an equivalent one-way nondeterministic finite automaton with at most 2n n+1 states. We also show this bound is exact.
منابع مشابه
From Bidirectionality to Alternation
We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on finite words, and extend it to automata on infinite words.
متن کاملRemoving Nondeterminism in Constant Height Pushdown Automata
We study the descriptional cost of removing nondeterminism in constant height pushdown automata — i.e., pushdown automata with a built-in constant limit on the height of the pushdown. We show a double-exponential size increase when converting a constant height nondeterministic pushdown automaton into an equivalent deterministic device. Moreover, we prove that such a double-exponential blow-up c...
متن کامل{\omega}-Automata
This paper gives a concise introduction into the basic theory of ω-automata (as of March 2014). The starting point are the different types of recurrence conditions, modes of operation (deterministic, nondeterministic, alternating automata), and directions (forward or backward automata). The main focus is on fundamental automata constructions, for instance, for boolean operations, determinizatio...
متن کاملAmbiguity of Unary Symmetric Difference NFAs
Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the fi...
متن کاملEfficient reduction of nondeterministic automata with application to language inclusion testing
We present efficient algorithms to reduce the size of nondeterministic Büchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, and inclusion for much larger instances than was previously possible (≥ 1000 states instead of 10-10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005